A companion matrix analogue for orthogonal polynomials

A companion matrix resultant for Bernstein polynomials

On Orthogonal Matrix Polynomials

In this paper we deal with orthogonal matrix polynomials. First of all, we establish some basic notations and results we need later. A matrix polynomial P is a matrix whose entries are polynomials, or, equivalently, a combination P(t) = A 0 +A 1 t+ +A n t n , where A 0 ; ; A n are numerical matrices (the size of all the matrices which appear in this paper is N N). A positive deenite matrix of m...

Zero Asymptotic Behaviour for Orthogonal Matrix Polynomials

Weak-star asymptotic results are obtained for the zeros of orthogonal matrix polynomials (i.e. the zeros of their determinants) on R from two di®erent assumptions: ̄rst from the convergence of matrix coe±cients occurring in the three-term recurrence for these polynomials and, second, from some conditions on the generating matrix measure. The matrix analogue of the Chebyshev polynomials of the ̄...

2 Rectangular Matrix Orthogonal Polynomials

Classical orthogonal polynomials and matrix polynomials being orthogonal with respect to some Hermitean positive deenite matrix of measures share several properties , e.g., three term recurrencies, Christooel{Darboux formulas; there are connections to the triangular decomposition of the (inverse) moment matrix and to eigenvalue{problems for the banded matrix of recurrence coeecients. Also, a co...

Palindromic companion forms for matrix polynomials of odd degree

The standard way to solve polynomial eigenvalue problems P (λ)x = 0 is to convert the matrix polynomial P (λ) into a matrix pencil that preserves its spectral information– a process known as linearization. When P (λ) is palindromic, the eigenvalues, elementary divisors, and minimal indices of P (λ) have certain symmetries that can be lost when using the classical first and second Frobenius comp...